0.00/0.10	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.10	% Command    : run_E %s %d THM
0.09/0.29	% Computer : n032.cluster.edu
0.09/0.29	% Model    : x86_64 x86_64
0.09/0.29	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.29	% Memory   : 8042.1875MB
0.09/0.29	% OS       : Linux 3.10.0-693.el7.x86_64
0.09/0.29	% CPULimit   : 1440
0.09/0.29	% WCLimit    : 180
0.09/0.29	% DateTime   : Thu Jul  4 10:18:54 EDT 2024
0.09/0.29	% CPUTime    : 
0.15/0.40	Running higher-order theorem proving
2.53/2.75	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.wYFzBOQ442/E---3.1_906.p
57.13/17.07	# Version: 3.2.0-ho
57.13/17.07	# partial match(1): HMLMSMSMSSLCHFA
57.13/17.07	# Preprocessing class: HMLMSMLMSSLCHFA.
57.13/17.07	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
57.13/17.07	# Starting new_ho_10 with 900s (5) cores
57.13/17.07	# Starting sh5l with 180s (1) cores
57.13/17.07	# Starting new_bool_1 with 180s (1) cores
57.13/17.07	# Starting new_bool_2 with 180s (1) cores
57.13/17.07	# new_bool_2 with pid 1072 completed with status 0
57.13/17.07	# Result found by new_bool_2
57.13/17.07	# partial match(1): HMLMSMSMSSLCHFA
57.13/17.07	# Preprocessing class: HMLMSMLMSSLCHFA.
57.13/17.07	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
57.13/17.07	# Starting new_ho_10 with 900s (5) cores
57.13/17.07	# Starting sh5l with 180s (1) cores
57.13/17.07	# Starting new_bool_1 with 180s (1) cores
57.13/17.07	# Starting new_bool_2 with 180s (1) cores
57.13/17.07	# SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
57.13/17.07	# Search class: HGHSM-SMLM32-DHFFFFBN
57.13/17.07	# partial match(1): HGHSM-SMLM32-DHFFFSBN
57.13/17.07	# Scheduled 5 strats onto 1 cores with 179 seconds (179 total)
57.13/17.07	# Starting new_ho_10 with 108s (1) cores
57.13/17.07	# new_ho_10 with pid 1073 completed with status 0
57.13/17.07	# Result found by new_ho_10
57.13/17.07	# partial match(1): HMLMSMSMSSLCHFA
57.13/17.07	# Preprocessing class: HMLMSMLMSSLCHFA.
57.13/17.07	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
57.13/17.07	# Starting new_ho_10 with 900s (5) cores
57.13/17.07	# Starting sh5l with 180s (1) cores
57.13/17.07	# Starting new_bool_1 with 180s (1) cores
57.13/17.07	# Starting new_bool_2 with 180s (1) cores
57.13/17.07	# SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
57.13/17.07	# Search class: HGHSM-SMLM32-DHFFFFBN
57.13/17.07	# partial match(1): HGHSM-SMLM32-DHFFFSBN
57.13/17.07	# Scheduled 5 strats onto 1 cores with 179 seconds (179 total)
57.13/17.07	# Starting new_ho_10 with 108s (1) cores
57.13/17.07	# Preprocessing time       : 0.181 s
57.13/17.07	# Presaturation interreduction done
57.13/17.07	
57.13/17.07	# Proof found!
57.13/17.07	# SZS status Theorem
57.13/17.07	# SZS output start CNFRefutation
57.13/17.07	thf(decl_sort1, type, nat: $tType).
57.13/17.07	thf(decl_sort2, type, num: $tType).
57.13/17.07	thf(decl_sort3, type, list_VEBT_VEBT: $tType).
57.13/17.07	thf(decl_sort4, type, vEBT_VEBT: $tType).
57.13/17.07	thf(decl_208, type, one_one_nat: nat).
57.13/17.07	thf(decl_379, type, nth_VEBT_VEBT: list_VEBT_VEBT > nat > vEBT_VEBT).
57.13/17.07	thf(decl_405, type, suc: nat > nat).
57.13/17.07	thf(decl_476, type, bit0: num > num).
57.13/17.07	thf(decl_478, type, one: num).
57.13/17.07	thf(decl_486, type, numeral_numeral_nat: num > nat).
57.13/17.07	thf(decl_697, type, divide_divide_nat: nat > nat > nat).
57.13/17.07	thf(decl_842, type, vEBT_VEBT_high: nat > nat > nat).
57.13/17.07	thf(decl_844, type, vEBT_VEBT_low: nat > nat > nat).
57.13/17.07	thf(decl_861, type, vEBT_vebt_member: vEBT_VEBT > nat > $o).
57.13/17.07	thf(decl_918, type, deg: nat).
57.13/17.07	thf(decl_923, type, na: nat).
57.13/17.07	thf(decl_924, type, pr: nat).
57.13/17.07	thf(decl_927, type, treeList: list_VEBT_VEBT).
57.13/17.07	thf(decl_929, type, za: nat).
57.13/17.07	thf(conj_0, conjecture, (vEBT_vebt_member @ (nth_VEBT_VEBT @ treeList @ (vEBT_VEBT_high @ za @ (divide_divide_nat @ deg @ (numeral_numeral_nat @ (bit0 @ one))))) @ (vEBT_VEBT_low @ za @ (divide_divide_nat @ deg @ (numeral_numeral_nat @ (bit0 @ one))))), file('/export/starexec/sandbox2/tmp/tmp.wYFzBOQ442/E---3.1_906.p', conj_0)).
57.13/17.07	thf(fact_2_abe, axiom, (vEBT_vebt_member @ (nth_VEBT_VEBT @ treeList @ (vEBT_VEBT_high @ za @ (divide_divide_nat @ deg @ (numeral_numeral_nat @ (bit0 @ one))))) @ (vEBT_VEBT_low @ za @ (divide_divide_nat @ deg @ (numeral_numeral_nat @ (bit0 @ one))))), file('/export/starexec/sandbox2/tmp/tmp.wYFzBOQ442/E---3.1_906.p', fact_2_abe)).
57.13/17.07	thf(fact_1019_Suc__1, axiom, ((suc @ one_one_nat)=(numeral_numeral_nat @ (bit0 @ one))), file('/export/starexec/sandbox2/tmp/tmp.wYFzBOQ442/E---3.1_906.p', fact_1019_Suc__1)).
57.13/17.07	thf(fact_9__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062, axiom, ((divide_divide_nat @ deg @ (numeral_numeral_nat @ (bit0 @ one)))=(na)), file('/export/starexec/sandbox2/tmp/tmp.wYFzBOQ442/E---3.1_906.p', fact_9__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062)).
57.13/17.07	thf(fact_0_True, axiom, ((vEBT_VEBT_high @ za @ (divide_divide_nat @ deg @ (numeral_numeral_nat @ (bit0 @ one))))=(pr)), file('/export/starexec/sandbox2/tmp/tmp.wYFzBOQ442/E---3.1_906.p', fact_0_True)).
57.13/17.07	thf(c_0_5, negated_conjecture, ~(vEBT_vebt_member @ (nth_VEBT_VEBT @ treeList @ (vEBT_VEBT_high @ za @ (divide_divide_nat @ deg @ (numeral_numeral_nat @ (bit0 @ one))))) @ (vEBT_VEBT_low @ za @ (divide_divide_nat @ deg @ (numeral_numeral_nat @ (bit0 @ one))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])).
57.13/17.07	thf(c_0_6, plain, (vEBT_vebt_member @ (nth_VEBT_VEBT @ treeList @ (vEBT_VEBT_high @ za @ (divide_divide_nat @ deg @ (numeral_numeral_nat @ (bit0 @ one))))) @ (vEBT_VEBT_low @ za @ (divide_divide_nat @ deg @ (numeral_numeral_nat @ (bit0 @ one))))), inference(split_conjunct,[status(thm)],[fact_2_abe])).
57.13/17.07	thf(c_0_7, plain, ((suc @ one_one_nat)=(numeral_numeral_nat @ (bit0 @ one))), inference(split_conjunct,[status(thm)],[fact_1019_Suc__1])).
57.13/17.07	thf(c_0_8, plain, ((divide_divide_nat @ deg @ (numeral_numeral_nat @ (bit0 @ one)))=(na)), inference(split_conjunct,[status(thm)],[fact_9__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062])).
57.13/17.07	thf(c_0_9, plain, ((vEBT_VEBT_high @ za @ (divide_divide_nat @ deg @ (numeral_numeral_nat @ (bit0 @ one))))=(pr)), inference(split_conjunct,[status(thm)],[fact_0_True])).
57.13/17.07	thf(c_0_10, negated_conjecture, ~((vEBT_vebt_member @ (nth_VEBT_VEBT @ treeList @ (vEBT_VEBT_high @ za @ (divide_divide_nat @ deg @ (numeral_numeral_nat @ (bit0 @ one))))) @ (vEBT_VEBT_low @ za @ (divide_divide_nat @ deg @ (numeral_numeral_nat @ (bit0 @ one)))))), inference(split_conjunct,[status(thm)],[c_0_5])).
57.13/17.07	thf(c_0_11, plain, (vEBT_vebt_member @ (nth_VEBT_VEBT @ treeList @ (vEBT_VEBT_high @ za @ (divide_divide_nat @ deg @ (suc @ one_one_nat)))) @ (vEBT_VEBT_low @ za @ (divide_divide_nat @ deg @ (suc @ one_one_nat)))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6, c_0_7]), c_0_7])).
57.13/17.07	thf(c_0_12, plain, ((divide_divide_nat @ deg @ (suc @ one_one_nat))=(na)), inference(rw,[status(thm)],[c_0_8, c_0_7])).
57.13/17.07	thf(c_0_13, plain, ((vEBT_VEBT_high @ za @ na)=(pr)), inference(rw,[status(thm)],[c_0_9, c_0_8])).
57.13/17.07	thf(c_0_14, negated_conjecture, ~((vEBT_vebt_member @ (nth_VEBT_VEBT @ treeList @ (vEBT_VEBT_high @ za @ na)) @ (vEBT_VEBT_low @ za @ na))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10, c_0_8]), c_0_8])).
57.13/17.07	thf(c_0_15, plain, (vEBT_vebt_member @ (nth_VEBT_VEBT @ treeList @ pr) @ (vEBT_VEBT_low @ za @ na)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11, c_0_12]), c_0_13]), c_0_12])).
57.13/17.07	thf(c_0_16, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14, c_0_13]), c_0_15])]), ['proof']).
57.13/17.07	# SZS output end CNFRefutation
57.13/17.07	# Parsed axioms                        : 11244
57.13/17.07	# Removed by relevancy pruning/SinE    : 7135
57.13/17.07	# Initial clauses                      : 11355
57.13/17.07	# Removed in clause preprocessing      : 2021
57.13/17.07	# Initial clauses in saturation        : 9334
57.13/17.07	# Processed clauses                    : 11600
57.13/17.07	# ...of these trivial                  : 339
57.13/17.07	# ...subsumed                          : 3138
57.13/17.07	# ...remaining for further processing  : 8122
57.13/17.07	# Other redundant clauses eliminated   : 2959
57.13/17.07	# Clauses deleted for lack of memory   : 0
57.13/17.07	# Backward-subsumed                    : 56
57.13/17.07	# Backward-rewritten                   : 111
57.13/17.07	# Generated clauses                    : 2591
57.13/17.07	# ...of the previous two non-redundant : 2225
57.13/17.07	# ...aggressively subsumed             : 0
57.13/17.07	# Contextual simplify-reflections      : 124
57.13/17.07	# Paramodulations                      : 7
57.13/17.07	# Factorizations                       : 0
57.13/17.07	# NegExts                              : 0
57.13/17.07	# Equation resolutions                 : 2959
57.13/17.07	# Disequality decompositions           : 0
57.13/17.07	# Total rewrite steps                  : 19740
57.13/17.07	# ...of those cached                   : 18901
57.13/17.07	# Propositional unsat checks           : 0
57.13/17.07	#    Propositional check models        : 0
57.13/17.07	#    Propositional check unsatisfiable : 0
57.13/17.07	#    Propositional clauses             : 0
57.13/17.07	#    Propositional clauses after purity: 0
57.13/17.07	#    Propositional unsat core size     : 0
57.13/17.07	#    Propositional preprocessing time  : 0.000
57.13/17.07	#    Propositional encoding time       : 0.000
57.13/17.07	#    Propositional solver time         : 0.000
57.13/17.07	#    Success case prop preproc time    : 0.000
57.13/17.07	#    Success case prop encoding time   : 0.000
57.13/17.07	#    Success case prop solver time     : 0.000
57.13/17.07	# Current number of processed clauses  : 45
57.13/17.07	#    Positive orientable unit clauses  : 15
57.13/17.07	#    Positive unorientable unit clauses: 0
57.13/17.07	#    Negative unit clauses             : 30
57.13/17.07	#    Non-unit-clauses                  : 0
57.13/17.07	# Current number of unprocessed clauses: 5286
57.13/17.07	# ...number of literals in the above   : 18552
57.13/17.07	# Current number of archived formulas  : 0
57.13/17.07	# Current number of archived clauses   : 5494
57.13/17.07	# Clause-clause subsumption calls (NU) : 31290960
57.13/17.07	# Rec. Clause-clause subsumption calls : 1761420
57.13/17.07	# Non-unit clause-clause subsumptions  : 3103
57.13/17.07	# Unit Clause-clause subsumption calls : 36107
57.13/17.07	# Rewrite failures with RHS unbound    : 0
57.13/17.07	# BW rewrite match attempts            : 888
57.13/17.07	# BW rewrite match successes           : 287
57.13/17.07	# Condensation attempts                : 11601
57.13/17.07	# Condensation successes               : 48
57.13/17.07	# Termbank termtop insertions          : 3421164
57.13/17.07	# Search garbage collected termcells   : 198045
57.13/17.07	
57.13/17.07	# -------------------------------------------------
57.13/17.07	# User time                : 13.307 s
57.13/17.07	# System time              : 0.102 s
57.13/17.07	# Total time               : 13.409 s
57.13/17.07	# Maximum resident set size: 50576 pages
57.13/17.07	
57.13/17.07	# -------------------------------------------------
57.13/17.07	# User time                : 14.000 s
57.13/17.07	# System time              : 0.130 s
57.13/17.07	# Total time               : 14.130 s
57.13/17.07	# Maximum resident set size: 26932 pages
57.13/17.07	% E---3.1 exiting
57.13/17.07	% E exiting
57.13/17.08	EOF
